Minimizing makespan on a single machine with release dates and inventory constraints
نویسندگان
چکیده
منابع مشابه
Minimizing Makespan on Single Machine with Release Dates
This paper considers the single criterion scheduling problem of minimizing makespan on a single machine with release dates. The problem is, by nature, NP-Hard, hence approximation algorithms are desired in order to solve the problem. An algorithm (called NAL) is proposed for the problem. The NAL algorithm is compared with the branch and bound (BB) method and a test algorithm (AEO) selected from...
متن کاملMinimizing Makespan and Total Completion Time Criteria on a Single Machine with Release Dates
1 Department of Computer Science University for Development Studies, Ghana 2 Department of Industrial and Production Engineering University of Ibadan, Nigeria Corresponding Author: E. O. Oyetunji _________________________________________________________________________________________________ Abstract This paper considers the scheduling problem of simultaneously minimizing the makespan and tota...
متن کاملMinimizing the Sum of Makespan and Maximum Tardiness on Single Machine with Release Dates
This paper considers the bicriteria scheduling problem of simultaneously minimizing makespan (Cmax) and maximum tardiness (Tmax) on a single machine with release dates. The problem is, by nature, NP-Hard. Therefore, one approximation algorithm (labeled as CTA1) was proposed for solving this problem. The CTA1 algorithm was compared with the Branch and Bounds (BB) procedure specifically implement...
متن کاملMinimizing total weighted tardiness on a single machine with release dates and equal-length jobs
In this paper we look at the problem where we have to schedule n jobs with release dates, due dates, weights, and equal processing times on a single machine. The objective is to minimize the sum of weighted tardiness (1|rj , pj = p| ∑ wjTj in the threefield notation scheme). We formulate the problem as a time indexed ILP after which we solve the LP-relaxation. We show that for certain special c...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2020.03.029